Automated Proofs for Some Stirling Number Identities
نویسندگان
چکیده
We present computer-generated proofs of some summation identities for (q-)Stirling and (q-)Eulerian numbers that were obtained by combining a recent summation algorithm for Stirling number identities with a recurrence solver for difference fields.
منابع مشابه
Convolution Identities for Stirling Numbers of the First Kind via Involution
We provide bijective proofs of some recent convolution identities for the Stirling numbers of the first kind, which were proven earlier using algebraic methods, by defining appropriate sign-changing involutions.
متن کاملq-Stirling Identities Revisited
We give combinatorial proofs of q-Stirling identities using restricted growth words. This includes a poset theoretic proof of Carlitz’s identity, a new proof of the q-Frobenius identity of Garsia and Remmel and of Ehrenborg’s Hankel q-Stirling determinantal identity. We also develop a two parameter generalization to unify identities of Mercier and include a symmetric function version.
متن کاملA Combinatorial Interpretation of Identities Involving Stirling Numbers and Their Generalizations
Purely combinatorial methods are used to show that Stirling numbers, defined combinatorially, satisfy orthogonality relations. The proofs are extended to several generalizations of Stirling numbers.
متن کاملAlternative Proofs on the 2-adic Order of Stirling Numbers of the Second Kind
An interesting 2-adic property of the Stirling numbers of the second kind S(n, k) was conjectured by the author in 1994 and proved by De Wannemacker in 2005: ν2(S(2, k)) = d2(k) − 1, 1 ≤ k ≤ 2n. It was later generalized to ν2(S(c2, k)) = d2(k) − 1, 1 ≤ k ≤ 2n, c ≥ 1 by the author in 2009. Here we provide full and two partial alternative proofs of the generalized version. The proofs are based on...
متن کاملSummation algorithms for Stirling number identities
We consider a class of sequences defined by triangular recurrence equations. This class contains Stirling numbers and Eulerian numbers of both kinds, and hypergeometric multiples of those. We give a sufficient criterion for sums over such sequences to obey a recurrence equation, and present algorithms for computing such recurrence equations efficiently. Our algorithms can be used for verifying ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 15 شماره
صفحات -
تاریخ انتشار 2008